Windowing methods and systems for use in time-frequency analysis

ABSTRACT

The present embodiments include methods of time-frequency analyzing signals. Some embodiments provide methods of processing signals comprising: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal; transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of signal in the frequency domain; and mapping the samples in the frequency domain back into the time domain.

This application claims the benefit of U.S. Provisional Application No. 61/482,424, filed May 4, 2011, for Stephen D. Casey, entitled WINDOWING SYSTEMS FOR TIME-FREQUENCY ANALYSIS, and U.S. Provisional Application No. 61/482,435, filed May 4, 2011, for Stephen D. Casey et al., entitled ADAPTIVE AND ULTRA-WIDEBAND SAMPLING VIA PROJECTION, both of which are incorporated in their entirety herein by reference.

The United States Government may have rights in this invention pursuant to Contract No. DAAD19-02-D-0001 between U.S. Army Research Office Scientific Services program and American University.

BACKGROUND

1. Field of the Invention

The present invention relates generally to time-frequency analysis, and more specifically to signal processing.

2. Discussion of the Related Art

The communication of information has always been important. The amount of information that is communicated continues to rapidly increase. Further, the importance of those communications continues to increase.

As people become more mobile and as technology continues to advance the amount of information communicate is expected to continue to increase.

SUMMARY OF THE INVENTION

Several embodiments of the invention advantageously address the needs above as well as other needs through methods of providing time-frequency analysis, such as in the processing of signals. Some embodiments provide methods of processing signals comprising: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal; transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of signal in the frequency domain while preserving orthogonality of basis elements in the windows, including regions of overlap; and mapping the samples in the frequency domain back into the time domain.

Further embodiments provide methods of processing a signal, comprising: receiving a signal; partitioning the signal in a time domain into a plurality of windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain, where for each window of the signal of the respective expansions are obtained through parallel processing obtaining in parallel respective samples of the windows of signal in the frequency domain.

Additionally, some embodiments provide method of processing a signal, comprising: processing a signal; partitioning the signal in a time domain into a plurality of windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of signal in the frequency domain while preserving orthogonality between at least two of the plurality of windows.

Other embodiments provide methods of processing a signal, comprising: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal, wherein the adaptively partitioning comprises applying B-splines in constructing the windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain and analyzing the transformed windows of the signal in the frequency domain.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features and advantages of several embodiments of the present invention will be more apparent from the following more particular description thereof, presented in conjunction with the following drawings.

FIG. 1 depicts a simplified flow diagram of a process of signal sampling and/or analyzing in accordance with some embodiments.

FIG. 2 depicts a simplified flow diagram of a process of projection methods of sampling according to some embodiments.

FIG. 3A depicts a simplified graphical representation of a signal.

FIG. 3B shows an enlarged version of a portion of the signal of FIG. 3A with windows defined over a portion of the signal in accordance with some embodiments.

FIG. 4 shows a graphical representation of a series of windows, in accordance with some embodiments.

FIG. 5 shows an example sampling technique in accordance with a standard Shannon (W-K-S) sampling.

FIGS. 6A-6B show simplified graphical representations of a method of projection sampling in accordance with some embodiments.

FIG. 7 shows a simplified graphical representation of at least portions of a series of windows, in accordance with some embodiments, provided in response to the windowing provided in the process of FIG. 2.

FIG. 8 shows a simplified flow diagram of a process of providing the transmission and/or analysis of the windowed signal, in accordance with some embodiments.

FIG. 9 depicts a simplified flow diagram of a process of providing a reconstruction and/or synthesis of coefficients in accordance with some embodiments.

FIG. 10 illustrates a system that may be used in processing signals in accordance with at least some embodiments.

FIG. 11 illustrates a system for use in implementing methods, techniques, devices, apparatuses, systems, modules, units and the like in providing user interactive virtual environments in accordance with some embodiments.

Corresponding reference characters indicate corresponding components throughout the several views of the drawings. Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments of the present invention. Also, common but well-understood elements that are useful or necessary in a commercially feasible embodiment are often not depicted in order to facilitate a less obstructed view of these various embodiments of the present invention.

DETAILED DESCRIPTION

The following description is not to be taken in a limiting sense, but is made merely for the purpose of describing the general principles of exemplary embodiments. The scope of the invention should be determined with reference to the claims.

Reference throughout this specification to “one embodiment,” “an embodiment,” “some embodiments,” “some implementations” or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “in one embodiment,” “in an embodiment,” “in some embodiments,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.

Furthermore, the described features, structures, or characteristics of the invention may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of programming, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.

The present embodiments provide methods and systems for use providing time-frequency analysis, such as in processing communication signals and other relevant signals. The signal processing can include, for example, improved sampling, filtering, encoding, analog-to-digital conversion, and other processing. Some embodiments employ a windowing technique that provides effective time and/or frequency analysis of functions. Still further, some embodiments provide windowing that can have variable partitioning length, variable roll-off and/or variable smoothness. This variable windowing can be particularly effective, for example, with adaptive frequency band (AFB) and ultra-wide band (UWB) signals and systems, and other relevant signals and systems.

FIG. 1 depicts a simplified flow diagram of a process 110 of signal sampling and/or analyzing in accordance with some embodiments. In step 112 a signal is received. In step 114, the signal is partitioned into windows or blocks (sometimes referred to as tiles) based on time. Further, the partitioning can provide for adaptive partitioning such that windows or blocks can be can vary, in at least some embodiments, based on variations in, for example, bandwidth of the portions of the signal relative to corresponding windows of time. In step 116, the windows are processed to provide determine respective periodic expansions, for example, through Fourier series. In many implementations, the respective periodic expansions are approximations based on the series. In step 120, sampling is performed of the window of the signal in the frequency domain relative to basis coefficients. In step 122, the sampling is mapped back to the time domain. The mapping, in some instances can include reconstructing the signal from the sampling of basis coefficients to recover samples in the time domain.

The use of the varying blocks allows the methods and systems to accommodate varying bandwidths within a signal. Further, this variation provides enhanced sampling of varying signals, including signals such as adaptive frequency band (AFB) and ultra-wide band (UWB) signals. Additionally, some embodiments provide a sampling of signals through a basis projection as further describe below.

FIG. 2 depicts a simplified flow diagram of a process 210 of projection methods of sampling according to some embodiments. In step 212, a signal is windowed or blocked based on time. Again, the windowing may provide for adaptive windowing such that the windows can vary over the signal. In step 214, a time and/or frequency analysis is performed of the signal based on the windowing and the sampling obtained through the windowing. In step 216, a synthesis of the sampling is performed, which in part can provide a reindexing for the analysis of step 214.

FIG. 3A depicts a simplified graphical representation of a signal 310. The signal has a varying bandwidth, which can include for example a high frequency bursts 312 and/or portions of low bandwidth variation. FIG. 3B shows an enlarged version of a portion of the signal 310 of FIG. 3A, including the high frequency burst 312, with windows defined over a portion of the signal in accordance with some embodiments. As described above, some embodiments provide for windowing over the signal, and the windows can span various time durations of the signal.

Still referring to FIG. 3B, multiple windows W₁-W_(k) are defined over the portion of the signal 310 depicted. The windows W₁-W_(k) vary over the signal. For example, the windows W₂, W₃, etc. corresponding to the high frequency burst 312 have periods τ₂, τ₃, etc. that are shorter in time than, for example, the period τ₁ of the window W₁ preceding the high frequency burst 312 of the signal 310. Some embodiments may provide for discontinuity between windows. Other embodiments, as further described below, provide windows that can be defined with overlapping boundaries and/or regions.

The process of windowing a signal in time and/or frequency can enhance the time-frequency analysis of a signal. Low-pass, high-pass or band-pass filters can be developed by effective windowing in frequency, whereas windowing systems in time provide tools for local analysis of a given function. The present embodiments provide windowing methods and systems that provide effective blocking (or tiling), efficient roll-off, and smoothness-decay. Further, some embodiments provide variable partitioning length of the blocks, variable roll-off and/or variable smoothness.

Some embodiments construct smooth adaptive partitions of unity, or bounded adaptive partitions of unity systems, which can be generalizations of bounded uniform partitions of unity in that they allow for signal adaptive windowing. This can give a flexible adaptive partition of unity of variable smoothness and are useful whenever a partition of unity is used, such as in compressed sensing.

Many embodiments utilize splines, such as B-splines, as the construction elements. Some embodiments additionally preserve orthogonality of orthonormal (ON) system between adjacent blocks. The construction here uses orthonormal basis for L²(R) and can be created, for example, by solving a Hermite interpolation problem with constraints. These orthonormal preserving windowing provides systems and methods of time-frequency analysis for a wide class of signals. Alternatively, some embodiments employ a method of almost orthogonality. The almost orthogonality can employ the B-spline techniques to create almost orthogonal windowing that can, in at least some instances, be more easily computable and/or more readily implemented through hardware and/or software.

In accordance with some embodiments, windowing for partitions of unity {

} are configured with the intent of satisfying:

${\sum\limits_{k}{{??}_{k}(t)}} \equiv 1.$ A difference between the partition of unity systems and orthonormal methods and systems is that the orthonormal methods preserve orthogonality. Preserving orthogonality typically provides that the windowing systems {

_(k)(t)} satisfy [

_(k)(t)]²+[

_(k+1)(t)]²=1 for all k. The almost orthogonal systems provide that there exists a δ, 0≦δ≦½ such that 1−δ≦[

_(k)(t))]²+[

_(k+1)(t))]²≦1+δ.

Accordingly, the present embodiments comprise methods and systems that provide computable atomic decomposition of time-frequency space relative to signals and/or communications. At least some of these embodiments are configured to analyze signals and allow for changing frequency bands and/or ultra-wide frequency bands. This can be achieved through non-uniformly windowing or blocking time and/or frequency. When a signal has, for example, a burst of high-frequency information, some embodiments window or block quickly (or provide fairly short duration blocks) and efficiently in time and broadly in frequency, whereas when the signal has a relatively low-frequency segment, the methods and systems can block or window broadly in time and efficiently in frequency. The methods can be implemented through hardware and/or software.

At least some of the embodiments employ Fourier Series or other forms of transformation. Accordingly, let ƒ be a periodic, integrable function on

, with period 2Φ. i.e.. ƒεL¹(

_(2Φ)). The Fourier coefficients of ƒ. {circumflex over (ƒ)}[n], are defined by:

${\hat{f}\lbrack n\rbrack} = {\frac{1}{2\Phi}{\int_{- \Phi}^{\Phi}{{f(t)}{\exp\left( {{- {\mathbb{i}}}\ \pi\; n\;{t/\Phi}} \right)}{{\mathbb{d}t}.}}}}$ If {{circumflex over (ƒ)}[n]} is absolutely summable ({{circumflex over (ƒ)}[n]}εl¹), then the Fourier series of ƒ can be defined by:

${f(t)} = {\sum\limits_{n \in {\mathbb{Z}}}{{\hat{f}\lbrack n\rbrack}{{\exp\left( {{\mathbb{i}}\;\pi\; n\;{t/\Phi}} \right)}.}}}$ For ƒεL¹, the Fourier transform {circumflex over (ƒ)}(ω) is given as follows.

With the Fourier transform and inversion formulae, let ƒεL¹. The Fourier transform of ƒ can be defined as: {circumflex over (ƒ)}(ω)=

ƒ(t)e^(−2πitω) dt, for tε

(time), ωε

(frequency). The inversion formula, for {circumflex over (ƒ)}εL¹(

), can be defined by: ƒ(t)=({circumflex over (ƒ)})^(V)(t)=

{circumflex over (ƒ)}(ω)e^(2πiωt) dω The choice to have 2π in the exponent can simplify certain expressions in accordance with some embodiments, e.g., Parseval's equality— ∥ƒ∥_(L) ₂ ₍

₎=∥{circumflex over (ƒ)}∥_(L) ₂ ₍

₎. The transform and the coefficient integral can be considered as analysis, and the inverse transform and series as synthesis.

The process of periodization can be used in many if not all of the embodiments. Considering a block of a signal on an interval [0, T], the periodization of that signal block can be used to expand a Fourier series of sines and cosines. (see for example, J. J. Benedetto, Harmonic Analysis and Applications, CRC Press, Boca Raton, Fla., 1997. [1, p. 254], which is incorporated herein by reference in its entirety).

Further, letting T>0 and letting g(t) be a function such that supp g

[0, T]. The T-periodization of g can be:

${\lbrack g\rbrack^{\circ}(t)} = {\sum\limits_{n = {- \infty}}^{\infty}{{g\left( {t - {n\; T}} \right)}.}}$

Classical sampling theory applies to band-limited square integrable functions. A function that is both band-limited and L² typically has several smoothness and growth properties given in the Paley-Weiner Theorem. This class of functions can be referred to as

_(Ω). The Whittaker-Kotel'nikov-Shannon (W-K-S) Sampling Theorem applies to functions in

_(Ω). The Paley-Wiener Space

_(Ω) can be defined as:

_(Ω) ={ƒ: ƒ;{circumflex over (ƒ)}εL ²; supp({circumflex over (ƒ)})⊂[−Ω, Ω]} Based on the W-K-S Sampling Theorem, and let

${f \in {\mathbb{P}??}_{\Omega}},{{\sin\;{c_{T}(t)}} = {{\frac{\sin\left( {\frac{\pi}{t}t} \right)}{\pi\; t}\mspace{14mu}{and}\mspace{14mu}{\delta_{nT}(t)}} = {{\delta\left( {t - {nT}} \right)}.}}}$

a.) When T≦½Ω, then for tε

,

${f(t)} = {{T{\sum\limits_{n \in {\mathbb{Z}}}{{f({nT})}\frac{\sin\left( {\frac{\pi}{T}\left( {t - {nT}} \right)} \right)}{\pi\left( {t - {nT}} \right)}}}} = {{T\left( {\left\lbrack {\sum\limits_{n \in {\mathbb{Z}}}\delta_{nT}} \right\rbrack f} \right)}*\underset{T}{\sin\; c}{(t).}}}$

b.) When T≦½Ω and ƒ(nT)=0 for all nε

, then ƒ≡0.

We use the ON windowing systems to develop a sampling theory for ultra-wide and adaptive bandwidth signals.

Again, some embodiments operate through a projection of the signal onto blocks in time. For example, orthonormal (ON) windowing systems are provided and developed to provide incorporate a sampling theory for ultra-wide and adaptive bandwidth signals. Accordingly, the present embodiments can represent changes of view in sampling, from that of a stationary view of a signal used in classical sampling to, at least in part, an adaptive windowed view or adaptive windowed stationary view. For example, this adaptive windowing, such as with at least some AFB cases, provides that the time and frequency space block or tile occupied by the signal changes in time. The windows establish partitions of time and/or frequency so that the signal can be sampled efficiently. In ultra-wide band (UWB) cases, for example, advantage is taken of the windowing to partition the signal quickly and efficiently, and in some instances uniformly. In some embodiments, within the blocks, the signal can be sampled in parallel.

As introduced above, some embodiments provide partition of unity that provide for segmenting Time and/or Frequency (

-

) space. The partitioning provided can have variable partitioning length, variable roll-off, and/or variable smoothness. The windows make smooth adaptive partitions of unity, or bounded adaptive partitions of unity systems. For example, these can be generalizations of bounded uniform partitions of unity in that they allow for signal adaptive windowing. The construction elements for these methods and system are B-splines and take advantage of the concept of “perfect spline construction” (e.g., see I. J. Schoenberg, Cardinal Spline Interpolation (CBMS-NSF Conference Series in Applied Mathematics, 12), SIAM, Philadelphia, Pa., 1973, incorporated by reference). The B-splines give control over smoothness in time and corresponding decay in frequency. The present embodiments can be configured to provide varying degrees of smoothness with cutoffs adaptive to signal information, e.g., bandwidth.

For example, in some embodiments, a straightforward system is created by {χ_([(k)T,(k+1)T])(t)}, for kε

. A second example can be developed by studying the de la Vall'ee-Poussin kernel used in Fourier series (see T. W. Körner, Fourier Analysis, Cambridge University Press, Cambridge, 1988). Consider a signal block of length T+2r at the origin. Let 0<r<<T/2. Let Tri_(L)(t)=max{[((T/(4r))+r)−|t|/(2r)], 0}. Tri_(S)(t)=max{[((T/(4r))+r−1)−|t|/(2r)], 0} and Trap_([−T/2−r,T/2+r])(t)=Tri_(L)(t)−Tri_(S)(t).  (1)

The Trap function can have perfect overlay in the time domain and 1/ω² decay in frequency space. When one time block is ramping down, an adjacent time block is ramping up at the same rate, and typically at the exact same rate. The system using overlapping Trap functions has the advantage of 1/ω² decay in frequency. Let β_(L)=√{square root over (T/(4r)+r)}, α_(L)=T/(4r)+r/2, β_(S)=√{square root over (T/(4r)+r−1)}, and α_(S)=T/(4r)−r/2. The Fourier transform of Trap can be:

$\begin{matrix} {{{Trap}{\,^{\hat{\;}}(\omega)}} = {\left\lbrack {\left( \beta_{L} \right)\frac{\sin\left( {2\pi\;\alpha_{L}\omega} \right)}{\pi\;\omega}} \right\rbrack^{2} - {\left\lbrack {\left( \beta_{S} \right)\frac{\sin\left( {2\pi\;\alpha_{S}\omega} \right)}{\pi\;\omega}} \right\rbrack^{2}.}}} & (2) \end{matrix}$

Further, some embodiments provide a bounded adaptive partition of unity. A bounded adaptive partition of unity is a set of functions {

_(k)(t)} such that: (i.) supp(

_(k)(t))

[kT−r, (k+1)T+r] for all k. (ii.)

_(k)(t))≡1 for tε[kT+r, (k+1)T−r] for all k. (iii.) Σ

_(k)(t)≡1. (iv.) {

[n]} is absolutely summable. i.e. {

[n]}εl¹.  (3) Conditions (i.), (ii.) and (iii.) make {

_(k)(t)} a bounded partition of unity. Condition (iv.) provides for the computation of Fourier coefficients.

For example, let ƒε

_(Ω) and {

_(k)(t)} be a bounded adaptive partition of unity with generating window

_(I). Let [ƒ]° be the T+2r periodization of ƒ. Then

$\begin{matrix} {{\frac{1}{T + {2r}}{\int_{{{- T}/2} - r}^{{T/2} + r}{\left\lbrack {f \cdot {??}_{I}} \right\rbrack^{\circ}(t){\exp\left( {{- 2}\pi\;{\mathbb{i}}\; n\;{t/\left\lbrack {T + {2r}} \right\rbrack}} \right)}\ {\mathbb{d}t}}}} = {*{{\lbrack n\rbrack}.}}} & (4) \end{matrix}$

The above is supported as follows:

$\frac{1}{??}\int_{??}$ denote

$\frac{1}{T + {2r}}\int_{{{- T}/2} - r}^{{T/2} + r}$ and

denote [T+2r]. Then

$\begin{matrix} \begin{matrix} {{\hat{G}\lbrack n\rbrack} = {\frac{1}{??}{\int_{??}{\left\lbrack {f \cdot {??}_{I}} \right\rbrack^{\circ}(t){\exp\left( {{- 2}\pi\;{\mathbb{i}}\; n\;{t/{??}}} \right)}\ {\mathbb{d}t}}}}} \\ {= {\frac{1}{??}{\int_{??}{{\left\lbrack {\sum\limits_{k}{{\lbrack k\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; k\;{t/{??}}} \right)}}} \right\rbrack\lbrack f\rbrack}\ {{^\circ}(t)}{\exp\left( {{- 2}\pi\;{\mathbb{i}}\; n\;{t/{??}}} \right)}{\mathbb{d}t}}}}} \\ {= {\sum\limits_{k}{{\lbrack k\rbrack}\frac{1}{??}{\int_{??}{\lbrack f\rbrack{{^\circ}(t)}{\exp\left( {{- 2}\;\pi\;{{\mathbb{i}}\left( {n\  - k} \right)}{t/{??}}} \right)}{\mathbb{d}t}}}}}} \\ {= {\sum\limits_{k}{{\lbrack k\rbrack}{\left\lbrack {n - k} \right\rbrack}}}} \\ {= {*{{\lbrack n\rbrack}.}}} \end{matrix} & (5) \end{matrix}$ Examples:

-   -   {         _(k)(t)}=         χ_([(k)T,(k+1)T])(t)     -   {         _(k)(t)}=         Trap_([(k)T−r,(k+1)T+r])(t)

The above first example has jump discontinuities at segment boundaries of the blocks and has 1/ω decay in frequency. The above second example is continuous, but typically not differentiable, and has overlaps at segment boundaries of the blocks. This system has 1/ω² decay in frequency. Some embodiments generate systems by translations and dilations of a given window

_(I) where supp(

_(I))=[−T/2−r, T/2+r]. The generating window function

_(I) is k-times differentiable, has supp(

_(I))=[−T/2−r, T/2+r], and has values:

$\begin{matrix} {{??}_{I} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ 1 & {{t} \leq {{T/2} - r}} \\ {\rho\left( {\pm t} \right)} & {{{T/2} - r} < {t} < {{T/2} + {r.}}} \end{matrix} \right.} & (6) \end{matrix}$

The ρ(t) can be solved by solving the Hermite interpolation problem:

$\quad\left\{ \begin{matrix} \left( {a.} \right) & {{\rho\left( {{T/2} - r} \right)} = 1} \\ \left( {b.} \right) & {{{\rho^{(n)}\left( {{T/2} - r} \right)} = 0},{n = 1},2,{\ldots\mspace{14mu} k}} \\ \left( {c.} \right) & {{{\rho^{(n)}\left( {{T/2} + r} \right)} = 0},{n = 0},1,2,{\ldots\mspace{14mu}{k.}}} \end{matrix} \right.$ with the conditions that ρεC^(k) and [ρ(t))]+[ρ(−t))]=1 for tε[T/2−r, T/2+r]  (7)

As described above, B-splines can be used. In some embodiments the B-splines are used as the cardinal functions. For example, let 0<α<<β and consider χ_([−α,α]). It is desirable, in at least some embodiments, that the n-fold convolution of χ_([α,α]) fit in the interval [−β, β]. Further, α is chosen so that 0<nα<β, and let:

${\Psi(t)} = {\underset{n - {times}}{\underset{︸}{\chi_{\lbrack{{- \alpha},\alpha}\rbrack}*\chi_{\lbrack{{- \alpha},\alpha}\rbrack}*\mspace{11mu}\ldots\;*{\chi_{\lbrack{{- \alpha},\alpha}\rbrack}(t)}}}.}$ The β-periodic continuation of this function, Ψ°(t) has the Fourier series expansion

$\sum\limits_{k \neq 0}{{\frac{\alpha}{n\;\beta}\left\lbrack \frac{\sin\left( {\pi\; k\;{\alpha/n}\;\beta} \right)}{2\pi\; k\;{\alpha/n}\;\beta} \right\rbrack}^{n}{{\exp\left( {\pi\;{\mathbb{i}}\; k\;{t/\beta}} \right)}.}}$

The C^(k) solution for ρ is given by a theorem of Schoenberg (see I. J. Schoenberg, Cardinal Spline Interpolation (CBMS-NSF Conference Series in Applied Mathematics, 12), SIAM, Philadelphia, Pa., 1973, pp. 7-8). Schoenberg solved the Hermite interpolation problem with endpoints −1 and 1. An interpolant that minimizes the Chebyshev norm is called the perfect spline. The perfect spline S(t) for the Hermite problem with endpoints −1 and 1 such that S(1)=1, S ^((n))(1)=0, n=1, 2, . . . , k, S ^((n))(−1)=0, n=0, 1, 2, . . . , k is given by the integral of the function

${{M(x)} = {\left( {- 1} \right)^{n}{\sum\limits_{i = 0}^{k}\frac{\Psi\left( {t - t_{j}} \right)}{\phi^{\prime}\left( t_{j} \right)}}}},$ where Ψ is the k−1 convolution of characteristic functions, the knot points are

${t_{j} = {- {\cos\left( \frac{\pi\; j}{n} \right)}}},$ j=0, 1, . . . , n and φ(t)Π_(j=0) ^(k)(t−t_(j)). When k is even, the midpoint occurs at the k/2 knot point. If k is odd, the midpoint occurs at the midpoint between k/2 and (k+1)/2 knot points. Accordingly, the following is provided:

${{\rho(t)} = {{Sol}(t)}},{{{where}\mspace{14mu}{l(t)}} = {{{- \frac{1}{r}}t} + {\frac{T}{2r}.}}}$ For this ρ, and for

${??}_{I} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ 1 & {{t} \leq {{T/2} - r}} \\ {\rho\left( {\pm t} \right)} & {{{T/2} - r} < {t} < {{T/2} + {r.}}} \end{matrix} \right.$

(ω) is given by the antiderivative of a linear combination of functions of the form

$\left\lbrack \frac{\sin\left( {\pi\; k\;\alpha\;{\omega/n}\; T} \right)}{2\;\pi\; k\;\alpha\;{\omega/n}\; T} \right\rbrack^{n},$ and therefore has a decay of 1/ω^(n+1) in frequency.

As described above, some embodiments provide adaptive orthonormal (ON) windowing. These embodiments provide sets of windows so that the orthogonality of bases in adjacent and possible overlapping blocks is preserved. These embodiments are provide, in at least some implementations, based on solving a Hermite interpolation problem and enables control over smoothness in time and/or corresponding decay in frequency. In some embodiments, the systems implemented to provide varying degrees of smoothness with cutoffs adaptive to signal bandwidth.

Some system of signal segmentation use sine, cosine and linear functions. These embodiments can be relatively easy to implement, can cut down on frequency error and/or can preserve orthogonality. As an example, a signal block of length T+2r centered at the origin can be considered. Let 0<r<<T/2. In some instances, it is desirable to minimize r as small as possible. The Cap(t) can be defined as follows:

$\begin{matrix} {{{Cap}(t)} = \left\{ \begin{matrix} 0 & {{{t} \geq {{T/2} + r}},} \\ 1 & {{{t} \leq {{T/2} - r}},} \\ {\sin\left( {{\pi/\left( {4r} \right)}\left( {t + \left( {{T/2} + r} \right)} \right)} \right)} & {{{{{- T}/2} - r} < t < {{{- T}/2} + r}},} \\ {\cos\left( {{\pi/\left( {4r} \right)}\left( {t - \left( {{T/2} - r} \right)} \right)} \right)} & {{{T/2} - r} < t < {{T/2} + {r.}}} \end{matrix} \right.} & (8) \end{matrix}$

Given Cap, a blocking or tiling system {Cap_(k)(t)} can be formed such that supp(Cap_(k)(t))

[kT−r, (k+1)T+r] for all k. The Cap window has several properties that make it a good window for signal processing purposes. For example, the Cap window has a partition property in that it windows or bounds the signal in [−T/2−r, T/2+r] and is identically 1 on [−T/2+r, T/2−r]. Additionally, the Cap window has a continuous roll-off at the endpoints, and has the property that for all tε

[Cap_(k)(t))]²+[Cap_(k+1)(t))]²=1 This last condition preserves the orthogonality of basis elements between adjacent blocks. Additionally, it has 1/ω² decay in frequency space, and as a first time block is ramping down, an adjacent second block is ramping up at substantially if not exactly the same rate. The system using overlapping Cap functions can have the additional advantage of 1/ω² decay in frequency. For example, letting T=2 and r=1:

$\begin{matrix} {{{Cap}^{\hat{\;}}(\omega)} = {\left\lbrack \frac{{\sin\left( {2\pi\;\omega} \right)} + {4\omega\;\cos\;\left( {4\pi\;\omega} \right)}}{\pi\;{\omega\left( {{16\omega^{2}} - 1} \right)}} \right\rbrack.}} & (9) \end{matrix}$

Again, let [ƒ]° be the T+2r periodization of ƒ. Because of both [f]° and Cap have absolutely converging Fourier series,

${{\lbrack\rbrack}{{^\circ}\lbrack n\rbrack}} = {{\sum\limits_{m}{{\left\lbrack {n - m} \right\rbrack}{\lbrack m\rbrack}}} = {*{{{Cap}^{\hat{\;}}\lbrack n\rbrack}.}}}$

In theory the time domain may be cut up or blocked into perfectly aligned segments so that there is no loss of information. Further, the systems are configured to be smooth, so as to provide control over decay in frequency, have variable cut-off functions for flexibility in design, and adaptive, so as to adjust accordingly to changes in frequency band. Still further, the systems can be configured, in at least some embodiments, so that the orthogonality of bases in adjacent and possible overlapping blocks is preserved.

In some embodiments, an orthonormal (ON) window system may be configured according to a set of functions {

_(k)(t)} such that for all kε

(i.) supp(

_(k)(t))

[kT−r, (k+1)T+r]. (ii.)

_(k)(t))≡1 for tε[kT+r, (k+1)T−r], (iii.)

_(k)((kT+T/2)−t)=

_(k)(t 31 (kT+T/2)) for tε[0, T/2+r]. (iv.) [

_(k)(t))]²+[

_(k+1)(t))]²=1. (v.) {

[n]} is absolutely subbable, i.e. {

[n]}εI ¹.  (10)

Conditions (i.) and (ii.) are partition properties, in that they give a snapshot of the input function ƒ on [kT+r, (k+1)T−r], with smooth roll-off at the edges. Conditions (iii.) and (iv.) preserve orthogonality between adjacent blocks. Condition (v.) provides for the computation of Fourier coefficients.

Some embodiments provide systems by translations and dilations of a given window

_(I), where supp(

_(I))=[−T/2−r, T/2+r].

FIG. 4 shows a graphical representation of a series of windows 412-414, in accordance with some embodiments. In this representation, the windows are shows such that as a first window 412 is ramping down 416 an adjacent second window 413 is ramping up 418. Similarly, as the second window 413 is ramping down 420, a third window 414 is ramping up 422. Subsequent windows can be adaptively configured over the signal.

Condition (v.) above gives, for ƒε

_(Ω) and {

_(k)(t)} an orthonormal window system with generating window

_(I); that

1 T + 2 ⁢ r ⁢ ∫ - T / 2 - r T / 2 + r ⁢ [ f · ?? I ] ⁢ ° ⁢ ⁢ ( t ) ⁢ exp ⁡ ( - 2 ⁢π ⁢ ⁢ ⅈ ⁢ ⁢ n ⁢ ⁢ t / [ T + 2 ⁢ r ] ) ⁢ ⁢ ⅆ t = ⁢ * I ⁡ [ n ] . ( 11 ) Examples

-   -   {         _(k)(t)}=         χ_([(k)T,(k+1)T])(t)     -   {         _(k)(t)}=         Cap_([(k)T−r,(k+1)T+r])(t).         The first example has jump discontinuities at segment boundaries         of time blocks and has 1/ω decay in frequency. The second above         example is continuous but not differentiable, and has overlaps         at segment boundaries of the time blocks. Further, the second         system has 1/ω² decay in frequency. In some embodiments, general         window function         _(I) can be k-times differentiable, can have         supp(         _(I))=[−T/2−r, T/2+r], and         can have values

$\begin{matrix} {{??}_{I} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ 1 & {{t} \leq {{T/2} - r}} \\ {\rho\left( {\pm t} \right)} & {{{T/2} - r} < {t} < {{T/2} + {r.}}} \end{matrix} \right.} & (12) \end{matrix}$ The ρ(t) can be solved for by solving the Hermite interpolation problem:

$\quad\left\{ \begin{matrix} \left( {a.} \right) & {{\rho\left( {{T/2} - r} \right)} = 1} \\ \left( {b.} \right) & {{{\rho^{(n)}\left( {{T/2} - r} \right)} = 0},{n = 1},2,{\ldots\mspace{14mu} k}} \\ \left( {c.} \right) & {{{\rho^{(n)}\left( {{T/2} + r} \right)} = 0},{n = 0},1,2,{\ldots\mspace{14mu} k},} \end{matrix} \right.$ with the conditions that ρεC^(k) and [ρ(t))]²+[ρ(−t))]²=1 for [T/2−r]≦|t|≦[T/2+r].  (13)

The constraint (13) directs solutions, in some embodiments, to be expressed in terms of sin(t) and cos(t). Therefore, some embodiments solve this interpolation problem is through the method of undetermined coefficients. The below solution for ρ demonstrates that a C¹ window can be provided. It can initially be assumed that ρ(t)=A sin(B[T/2−t])+C, T/2≦t≦T/2+r. Since ρ is C¹, ρ′(T/2+r)=0; and so AB cos(B[r])=0, given B=π/2r. Window condition (iv.) above gives that 2[ρ(t/2)]²=1, and so C=√{square root over (2)}/2. Finally, ρ(T/2+r)=0, and so A=−√{square root over (2)}/2.

To extend ρ onto T/2−r≦t≦T/2, window condition (iv.) from above is again applied, providing

${\rho(t)} = {{{\sqrt{\left\lbrack {1 - {\frac{1}{2}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {\frac{T}{2} - t} \right)} \right)}} \right\rbrack}^{2}} \right\rbrack} \cdot \frac{T}{2}} - r} \leq t \leq {\frac{T}{2}.}}$ Further, using window conditions (ii.) and (iii.) from above providing:

$\begin{matrix} {{\rho(t)} = \left\{ \begin{matrix} {\frac{\sqrt{2}}{2}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {\frac{T}{2} - t} \right)} \right)}} \right\rbrack} & {{\frac{- T}{2} - r} \leq t \leq {\frac{- T}{2}.}} \\ \sqrt{\left\lbrack {1 - {\frac{1}{2}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {t - \frac{T}{2}} \right)} \right)}} \right\rbrack}^{2}} \right\rbrack} & {\frac{- T}{2} \leq t \leq {\frac{- T}{2} + {r.}}} \\ 1 & {{\frac{- T}{2} + r} < t < {\frac{T}{2} - {r.}}} \\ \sqrt{\left\lbrack {1 - {\frac{1}{2}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {\frac{T}{2} - t} \right)} \right)}} \right\rbrack}^{2}} \right\rbrack} & {{\frac{T}{2} - r} \leq t \leq {\frac{T}{2}.}} \\ {\frac{1}{\sqrt{2}}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {t - \frac{T}{2}} \right)} \right)}} \right\rbrack} & {\frac{T}{2} \leq t \leq {\frac{T}{2} + {r.}}} \end{matrix} \right.} & (14) \end{matrix}$ Accordingly, with each degree of smoothness, an additional degree of decay in frequency may be obtained with some embodiments.

The orthogonality between time blocks is also considered with some embodiments, where orthonormal (ON) window systems {

_(k)(t)} are configured so that they preserve orthogonality of basis element of overlapping blocks. Because of the partition properties of these systems, the orthogonality of adjacent overlapping blocks may be checked. Some constructions involve the folding technique described by Coifman and Meyer (e.g., see R. Coifman and Y. Meyer, Remarques sur l'analyse de Fourier a fenetre, CR Acad. Sci. Paris 312, 259-261, 1991). Further, in some embodiments, the systems are developed constructively by using spline theory. The construction can be considered based on how the extension for a system of sines and cosines could be implemented. In some embodiments, the odd reflections can be extended about the left endpoint and the even reflections about the right.

Let {φ_(j)(t)} be an orthonormal basis for L²[−T/2, T/2]. Define

$\begin{matrix} {{(t)} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ \varphi_{j\;{(t)}} & {{t} \leq {{T/2} - r}} \\ {- {\varphi_{j}\left( {{- T} - t} \right)}} & {{{{- T}/2} - r} < t < {{- T}/2}} \\ {\varphi_{j}\left( {T - t} \right)} & {{T/2} < t < {{T/2} + {r.}}} \end{matrix} \right.} & (15) \end{matrix}$

Taking into consideration the orthogonality of overlapping blocks, {Ψ_(k,j)}={

_(k)

(t)} can be an orthonormal basis for L²(

). With {

[n]}εl¹.

_(I)εL²[−T/2−r, T/2+r], it can follow that: ∥Ψ_(k,j)∥₂=∥

_(I)∥₂∥

_(∥) ₂<∞ Accordingly, it can be shown that

Ψ_(k,j), Ψ_(m,k)

=δ_(k,m)·δ_(j,n). The partitioning properties of the windows allow for limiting the checking to overlapping and adjacent windows. When k=m, the window can be considered as centered at the origin and the basis {tilde over (φ)}_(j). It can be shown that

_(I){tilde over (φ)}_(i),

_(I)

=δi,j. Computing provides:

〈 ?? I ⁢ i , ?? I ⁢ 〉 = ∫ - T / 2 - r - T / 2 ⁢ ( ?? I ⁡ ( t ) ) 2 ⁢ φ i ⁡ ( - T - t ) ⁢ φ j ⁡ ( - T - t ) ⁢ ⁢ ⅆ t + ∫ - T / 2 - T / 2 + r ⁢ ( ( ?? I ⁡ ( t ) ) 2 - 1 ) ⁢ φ i ⁡ ( t ) ⁢ φ j ⁢ ⁡ ( t ) ⁢ ⁢ ⅆ t + ∫ - T / 2 T / 2 ⁢ φ i ⁡ ( t ) ⁢ φ j ⁢ ( t ) ⁢ ⅆ t + ∫ T / 2 - r T / 2 ⁢ ( ( ?? I ⁡ ( t ) ) 2 - 1 ) ⁢ φ i ⁢ ⁡ ( t ) ⁢ φ j ⁡ ( t ) ⁢ ⁢ ⅆ t + ∫ T / 2 T / 2 + r ⁢ ( ?? I ⁡ ( t ) ) 2 ⁢ φ i ⁡ ( T - t ) ⁢ φ j ⁡ ( T - t ) ⁢ ⁢ ⅆ t . ( 16 )

Since {_(φj)} in an orthonormal basis, the third integral equals 1. A linear change of variables t=−T/2−τ can be applied to the first integral and t=−T/2+τ to the second integral. Adding these two integrals together provides: ∫₀ ^(r)[(

_(I)(T/2−τ))²+(

_(I)(τ−T/2))²−1]_(φi)(−T/2+τ)_(φj)(−T/2+τ)dτ Conditions (iii.) and (iv.) of our windowing system provides that the expression [(

_(I)(T/2−τ))²+(

_(I)(τ−T/2))²−1] equals zero, and therefore the above integral equals zero. Applying the linear change of variables t=T/2−τ to the fourth integral and t=T/2+τ to the fifth integral shows that these two integrals also sum to zero by essentially the same argument.

It is further verified that

_(k){tilde over (φ)}_(i),

_(l)

=δ_(k,l)·δ_(i,j). Again, the partitioning properties of the widows allows for confirmation by check adjacent windows. The symmetry of the construction allows the checking of

⁻¹ and

₀, where the overlapping region tε[−r, r] are checked. Accordingly, the following provides:

$\left\langle {{??}_{- 1}{{\overset{\sim}{\varphi}}_{i}.{??}_{0}}{\overset{\sim}{\varphi}}_{j}} \right\rangle = {0 + {\int_{- r}^{0}{\left( {{??}_{- 1}(t)} \right){\varphi_{i}(t)}\left( {{??}_{0}(t)} \right)\left( {- {\varphi_{j}\left( {- t} \right)}} \right){\mathbb{d}t}}} + {\int_{0}^{r}{\left( {{??}_{- 1}(t)} \right){\varphi_{i}\left( {- t} \right)}\left( {{??}_{0}(t)} \right){\varphi_{j}(t)}{{\mathbb{d}t}.}}}}$ Applying the linear change of variables t=−τ to the first integral and substituting the variable τ and adding provides: ∫₀ ^(r)[−

⁻¹(−τ)

₀(−τ)+

⁻¹(τ)

₀(τ)]_(φi)(−τ)_(φj)(τ)dτ. Condition (iii.) of the windowing system provides that the expression [−

⁻¹(−τ)

₀(−τ)+

⁻¹(τ)

₀(τ)] equals zero, and thus the integral equals zero. Combining these two computations shows that:

Ψ_(k,j), Ψ_(m,n)

=δ_(k,m)·δ_(j,n).

Further, it can be shown that {Ψ_(k,j} spans L) ²(

). Given a function ƒεL², the windowed element ƒ_(k)(t)=

_(k)(t)·ƒ(t) can be considered. First, the expansion in the window

_(I) symmetric to the origin is considered. Let ƒ_(I)(t)=

_(I)(t)·ƒ(t). The {_(φj)(t)} is an orthonormal basis for L²[−T/2, T/2]. Given ƒ_(I), define

$\begin{matrix} {{{\overset{\_}{f}}_{I}(t)} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ {f_{I}(t)} & {{t} \leq {{T/2} - r}} \\ {{f_{I}(t)} - {f_{I}\left( {{- T} - t} \right)}} & {{{{- T}/2} - r} < t < {{- T}/2}} \\ {{f_{I}(t)} + {f_{I}\left( {T - t} \right)}} & {{T/2} < t < {{T/2} + {r.}}} \end{matrix} \right.} & (18) \end{matrix}$ Since ƒ _(I)εL²[−T/2, T/2], it may be expanded as:

$\sum\limits_{j = 1}^{\infty}{\left\langle {{\overset{\_}{f}}_{I} \cdot \varphi_{j}} \right\rangle{{\varphi_{j}(t)}.}}$ To extend this to L²[−T/2−r, T/2+r], the expansion is performed according to {

(t)}, getting

$\begin{matrix} {{{\overset{\overset{\sim}{\_}}{f}}_{I} = {\sum\limits_{j = 1}^{\infty}{\left\langle {{\overset{\_}{f}}_{I} \cdot \varphi_{j}} \right\rangle{{\overset{\sim}{\varphi}}_{j}(t)}}}},{where}} & (19) \\ {{\overset{\overset{\sim}{\_}}{f}}_{I} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + r}} \\ {f_{I}(t)} & {{t} \leq {{T/2} + r}} \\ {{f_{I}(t)} - {f_{I}\left( {{- T} - t} \right)}} & {{{{- T}/2} - r} < t < {{{- T}/2} + r}} \\ {{f_{I}(t)} + {f_{I}\left( {T - t} \right)}} & {{{T/2} - r} < t < {{T/2} + {r.}}} \end{matrix} \right.} & (20) \end{matrix}$ Accordingly, this construction preservers orthogonality between adjacent blocks.

Additionally, with ƒ be any function in L², the windowed element f_(k)(t)=

_(k)(t)·ƒ(t) as considered. The construction above was repeated for this window, showing that, for fixed k, {Ψ_(k,j)} spans L²([kT−r, (k+1)T+r]) and preserves orthogonality between adjacent blocks on either side. Summing over all kε

gives that {Ψ_(k,j)} is an orthonormal basis for L²(

).

Taking advantage of the above described windowing systems, some embodiments provide projection sampling. For example, adaptive frequency band (AFB) and ultra-wide-band (UWB) systems typically need either rapidly changing or very high sampling rates. These rates stress signal reconstruction in a variety of ways. For example, sub-Nyquist sampling creates aliasing error, but error would also show up in truncation, jitter and amplitude, as computation is stressed. The W-K-S sampling does not have a way to accurately reconstruct the signal for sub-Nyquist samples nor adjust the sampling rate for variable band-width signals. Accordingly, with previous sampling, truncation can lose the energy in the lost samples, aliasing can introduce ambiguous information in the signal, and extremely high sampling can increase the likelihood of jitter error. Further, perturbations of sampling sets of ultra-wideband signals can result in unstable sampling sets.

Some present embodiments, however, provide sampling for adaptive frequency band and ultra-wide-band systems. Further, some of these embodiments provide a projection method. For example, the following was considered:

Let ƒ be a signal of finite energy in the Paley-Wiener class

_(Ω). For a block of time T, let

${f(t)} = {\sum\limits_{k \in {\mathbb{Z}}}{{f(t)}{{\chi_{\lbrack{{{(k)}T},{{({k + 1})}T}}\rbrack}(t)}.}}}$ With a given block ƒ_(k)(t)=ƒ(t)χ_([(k)T,(k+1)T])(t), the function can be T-periodically continued, such that: [ƒ_(k)]°(t)=[ƒ(t)χ_([(k)T,(k+1)T])(t)]°. Expanding (ƒ_(k))°(t) in a Fourier series, provides:

${{\left\lbrack f_{k} \right\rbrack{{^\circ}(t)}} = {\sum\limits_{n \in {\mathbb{Z}}}{{\lbrack n\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}}}},{where},{{\lbrack n\rbrack} = {\frac{1}{T}{\int_{{(k)}T}^{{({k + 1})}T}{{f(t)}{\exp\left( {{- 2}\;\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}\ {{\mathbb{d}t}.}}}}}$ The original function ƒ is Ω band-limited. However, the truncated block functions ƒ_(k) are not. Using the original Ω band-limit gives a lower bound on the number of non-zero Fourier coefficients

[n] as follows:

${\frac{n}{T} \leq \Omega},{i.e.},{n \leq {T \cdot {\Omega.}}}$ Accordingly, N=┌T·Ω┐ is chosen, where ┌·┐ denotes a ceiling function. For this choice of N, the following is computed:

$\begin{matrix} {{f(t)} = {\sum\limits_{k \in {\mathbb{Z}}}{{f(t)}{\chi_{\lbrack{{{(k)}T},{{({k + 1})}T}}\rbrack}(t)}}}} \\ {= {\sum\limits_{k \in {\mathbb{Z}}}{\left\lbrack {\left\lbrack f_{k} \right\rbrack{{^\circ}(t)}} \right\rbrack{\chi_{\lbrack{{{(k)}T},{{({k + 1})}T}}\rbrack}(t)}}}} \\ {\approx {\sum\limits_{k \in {\mathbb{Z}}}{\left\lbrack {\sum\limits_{n = {- N}}^{n = N}{{\lbrack n\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}}} \right\rbrack{{\chi_{\lbrack{{{(k)}T},{{({k + 1})}T}}\rbrack}(t)}.}}}} \end{matrix}$

It is noted that for this choice of the standard (sines, cosines) basis, it can be, for a fixed value of N, adjusted to a large bandwidth Ω by choosing small time blocks T. Also, after a given set of time blocks, an increase or decrease in bandwidth Ω can be accommodated by again adjusting the time blocks, e.g., given an increase in Ω, decrease T, and vice versa. These adjustments may result in the quality of the signal, as expressed in the accuracy the representation of ƒ, depends on N, Ω, and T.

Accordingly, the basic projection formula in accordance with some embodiments is given as follows. Let ƒε

_(Ω) and let T be a fixed block of time. Then, for N=┌T·Ω┐,

$\begin{matrix} \begin{matrix} {{f(t)} \approx {f_{proj}(t)}} \\ {= {\sum\limits_{k \in {\mathbb{Z}}}{\left\lbrack {\sum\limits_{n = {- N}}^{N}{{\lbrack n\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}}} \right\rbrack{{\chi_{\lbrack{{kT},{{({k + 1})}T}}\rbrack}(t)}.}}}} \end{matrix} & (21) \end{matrix}$

This can be shows as follows: again, let ƒε

_(Ω) fix a block T, and providing that:

${f(t)} = {\sum\limits_{k \in {\mathbb{Z}}}{{f(t)}{{\chi_{\lbrack{{k\; T},{{({k + 1})}T}}\rbrack}(t)}.}}}$ On each time block, periodically extend the function to a T-periodic function, getting [ƒ_(k)]°(t)=[ƒ(t)χ_([kT,(k+1)T])(t)]°(t). Since [ƒ_(k)]°(t) is a periodic function, it can be expanded into Fourier series

${{f_{k}{{^\circ}(t)}} = {\sum\limits_{n \in {\mathbb{Z}}}{{\lbrack n\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}}}},$ where the coefficients

[n] are defined by

${\lbrack n\rbrack} = {\frac{1}{T}{\int_{kT}^{{({k + 1})}T}{{f(t)}{\exp\left( {{- 2}\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}{{\mathbb{d}t}.}}}}$ Due to the fact the ƒ is Ω band-limited, it can be estimated that the value of n for which

[n] is non-zero. At minimum,

[n] is non-zero if

$\begin{matrix} {{\frac{n}{T} \leq \Omega},{{or}\mspace{14mu}{equivalently}},{n \leq {T \cdot {\Omega.{Let}}}}} & (22) \\ {N = {\left\lceil {T \cdot \Omega} \right\rceil.}} & (23) \end{matrix}$ Summing provides

$\begin{matrix} {{f(t)} \approx {f_{proj}(t)}} \\ {= {\sum\limits_{k \in {\mathbb{Z}}}{\left\lbrack {\sum\limits_{n = {- N}}^{N}{{\lbrack n\rbrack}{\exp\left( {2\pi\;{\mathbb{i}}\; n\;{t/T}} \right)}}} \right\rbrack{{\chi_{\lbrack{{kT},{{({k + 1})}T}}\rbrack}(t)}.}}}} \end{matrix}$

It is now evident how this method approximates the signal. Unlike the Shannon method which examined the function at specific points, then used those individual points to recreate the curve, the projection method in accordance with at least some embodiments breaks the signal into time blocks or windows and then approximates their respective periodic expansions with a Fourier series. This process allows the system to individually evaluate each piece and base its calculation on the needed bandwidth. The individual Fourier series are then summed, recreating a close approximation of the original signal. It is noted that instead of fixing T, the method allows for the fixing of any of the three variables (N, T and/or Ω) while allowing the other two to fluctuate. From the design point of view, in some implementations the easiest and most practical parameter to fix may be N. For situations in which the bandwidth does not need flexibility, it may be beneficial to fix Ω and/or T based on the equation N=┌T·Ω┐. However, if greater bandwidth Ω is need, shorter time blocks T may be selected.

The projection method can adapt to changes in the signal. For example, consider that the signal ƒ(t) has a band-limit Ω(t) that changes with time. This change effects the time blocking τ(t) and the number of basis elements N(t). This may make the analysis more complicated, but demonstrates at least some of the advantage of the projection method provided by some embodiments over conventional methods.

For example, during a given τ(t), let Ω(t)=max {Ω(t): tετ(t)}. For a signal ƒ that is Ω(t) band-limited, the value of n can be estimated for which

[n] is non-zero. At minimum,

[n] is non-zero if:

$\begin{matrix} {{\frac{n}{T(t)} \leq {\overset{\_}{\Omega}(t)}},{{or}\mspace{14mu}{equivalently}},{n \leq {{\tau(t)} \cdot {{\overset{\_}{\Omega}(t)}.{Let}}}}} \\ {{N(t)} = {\left\lceil {{\tau(t)} \cdot {\overset{\_}{\Omega}(t)}} \right\rceil.}} \end{matrix}$ For this choice of N(t), the basic adaptive projection formula is obtained.

The projection method also adapts to general orthonormal systems, much as Kramer-Weiss extends sampling to general orthonormal bases. For example, let ƒ, {circumflex over (ƒ)}εL²(

) and ƒ have a variable but bounded bandlimit Ω(t). Let τ(t) be an adaptive block of time. Given τ(t), let Ω(t)=max {Ω(t): tετ(t)}. Then N(t)=┌τ(t)·Ω(t)┐, ƒ(t)≈ƒp(t), where

$\begin{matrix} {{f_{\rho}(t)} = {\sum\limits_{k \in {\mathbb{Z}}}{\left\lbrack {\sum\limits_{n = {- {N{(t)}}}}^{N{(t)}}{{\lbrack n\rbrack}c^{({2\;\pi\;{{int}/\tau}}}}} \right\rbrack{{x_{\lbrack{{kT},{{({k + 1})}T}}\rbrack}(t)}.}}}} & (24) \end{matrix}$

Further, given a function ƒ such that ƒε

_(Ω), let T be a fixed time block. Define ƒ(t) and ƒ_(k)(t) as in the beginning of the computation above. Now, let {_(φn)} be a general orthonormal system for L²[0,T], and let {_(φn,k)(t)}={_(φn)(t−kT)}. Since ƒε

_(Ω), there exists N=N(T, Ω) such that {circumflex over (ƒ)}_(k)[n]=

ƒ·_(φn,k)

=0 for all n>N. In fact, let

$N = {{\max\limits_{n}\left\langle {f,\varphi_{n,k}} \right\rangle} \neq 0.}$ Expanding in a Fourier series relative {φ_(n,k)} gives

$\begin{matrix} {{{f_{k}(t)} = {\sum\limits_{n \in {\mathbb{Z}}}{{\hat{f_{k}}\lbrack n\rbrack}{\varphi_{n,k}(t)}}}},{{{where}\mspace{14mu}{\hat{f_{k}}\lbrack n\rbrack}} = {\left\langle {f_{k},\varphi_{n,k}} \right\rangle.}}} & (25) \end{matrix}$ Summing over all blocks gives the following.

Let {_(φn)} be a general orthonormal system for L²[0,T] and let {_(φn,k)(t)}={_(φn)(t−kT)}. Let N=N(T,Ω) be such that ƒ_(k)[n]=0 for all n>N. Therefore, ƒ(t)≈ƒp(t) where

$\begin{matrix} {{f_{P}(t)} = {\sum\limits_{k = {- \infty}}^{\infty}{\left\lbrack {\sum\limits_{n = {- N}}^{N}{\left\langle {f_{k},\varphi_{n,k}} \right\rangle{\varphi_{n,k}(t)}}} \right\rbrack{{x_{\lbrack{{kT},{{({k + 1})}T}}\rbrack}(t)}.}}}} & (26) \end{matrix}$

Accordingly, given characteristics of the class of input signals, the choice of basis functions used in the projection method can be tailored to optimal representation of the signal or a desired characteristic in the signal.

Further, some embodiments provide for the projection formula for orthonormal windowing. For example, let {

_(k)(t)} be a orthonormal window system, and let {Ψ_(k,j)} be an orthonormal basis that preserves orthogonality between adjacent windows. Let ƒε

_(Ω) be such that

ƒ·

_(k), Ψ_(n)

=0 for all n>N. Then, ƒ(t)≈ƒp(t), where

f P ⁡ ( t ) = ∑ k ∈ ℤ ⁢ [ ∑ n = - N N ⁢ 〈 f · k , Ψ n , k 〉 ⁢ Ψ n , k ⁡ ( t ) ] . ( 27 )

Given the flexibility of the windowing systems, some embodiments further provide for an adaptive projection system for the orthonormal window systems. Let ƒ, {circumflex over (ƒ)}·εL²(

) and ƒ have a variable but bounded band-limit Ω(t). Let τ(t) be an adaptive block of time. Let {

_(k)(t)} be a ON window system with window size τ(t)+2r on the kth block, and let {Ψ_(k,j)} be an orthonormal basis that preserves orthogonality between adjacent windows.

Given τ(t), let Ω(t)=max {Ω(t): ƒετ(t)}. Let N(t)=N(τ(t), Ω(t)) be such that

ƒ·

_(k), Ψ_(n,k)

=0. Then, ƒ(t)≈ƒp(t), where

f P ⁡ ( t ) = ∑ k ∈ ℤ ⁢ [ ∑ n = - N ⁡ ( t ) N ⁡ ( t ) ⁢ 〈 f · k , Ψ n , k 〉 ⁢Ψ n , k ⁡ ( t ) ] ( 28 ) Examples

{ Ψ kj } = { k ⁢ φ j ~ ⁡ ( t ) } . ⁢ where ⁢ ⁢ { k ⁢ ( t ) } = ⋃ k ∈ ℤ ⁢ χ [ ( k ) ⁢ T ⁡ ( k + 1 ) ⁢ T ] ⁡ ( t ) ⁢ ⁢ and { φ j ~ } = { ⁢ ( 2 ⁢ π ⁢ ⁢ n T ⁢ ( t - kT ) ) . ⁢ ( 2 ⁢ π ⁢ ⁢ n T ⁢ ( t - kT ) ) } . ⁢ { Ψ kj } = { k ⁢ φ j ~ ⁡ ( t ) } . ⁢ ⁢ where ⁢ ⁢ { k ⁢ ( t ) } = ⋃ k ∈ ℤ ⁢ Cap [ ( k ) ⁢ T - r · ( k + 1 ) ⁢ T + r ] ⁡ ( t ) ${{and}\left\{ \overset{\sim}{\varphi_{j}} \right\}} = {\left\{ {{\left( {\frac{2\pi\; n}{T}\left( {t - {kT}} \right)} \right).}\left( {\frac{2\pi\; n}{T}\left( {t - {kT}} \right)} \right)} \right\}.}$

The first example has jump discontinuities at segment boundaries and has 1/ω decay in frequency. The second example is continuous but not differentiable, and has overlaps at segment boundaries. This system has 1/ω² decay in frequency. The development of a C¹ system involves solving a Hermite interpolation problem for not only the window but also the folded basis elements. Using undetermined coefficients ρ can be solved for so that the window is C¹, getting

${\rho(t)} = \left\{ \begin{matrix} \sqrt{\left\lbrack {1 - {\frac{1}{2}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2r}\left( {\frac{T}{2} - t} \right)} \right)}} \right\rbrack}^{2}} \right\rbrack} & {{\frac{T}{2} - r} \leq t \leq {\frac{T}{2}.}} \\ {\frac{1}{\sqrt{2}}\left\lbrack {1 - {\sin\left( {\frac{\pi}{2}\left( {t - \frac{T}{2}} \right)} \right)}} \right\rbrack} & {{\frac{T}{2} \leq t \leq {\frac{T}{2} + r}},} \end{matrix} \right.$

Use the same technique can be used to solve for C¹ folded basis elements {

}. The constraints that make C¹ folded basis elements are

$\begin{matrix} \left\{ \begin{matrix} \left( {a.} \right) & {{\varphi_{j}\left( {{- T}/2} \right)} = 0} \\ \left( {b.} \right) & {{\varphi_{j}^{\prime}\left( {{- T}/2} \right)}\mspace{14mu}{exists}} \\ \left( {c.} \right) & {{\varphi_{j}^{\prime}\left( {T/2} \right)} = 0} \end{matrix} \right. & (29) \end{matrix}$ The constraint (29) can direct to solutions expressed in terms of sin(t) and cos(t). Solving the constraints (29) for φ_(j), provides:

$\begin{matrix} {{\varphi_{j}(t)} = {\sqrt{\frac{2}{T}}{\sin\left( {{\pi\left( {k + {1/2}} \right)}\frac{\left( {t + {T/2}} \right)}{T}} \right)}}} & (30) \end{matrix}$ Example: A C¹ system

-   -   {Ψ_(k,j)}={         _(k)         (t)}, where

l = { 0  t  ≥ T / 2 + r 1  t  ≤ T / 2 - r ρ ⁡ ( ± t ) T / 2 - r <  t  < T / 2 + r , ⁢ ⁢ with ⁢ ⁢ ρ ⁡ ( t ) = { [ 1 - 1 2 ⁡ [ 1 - sin ⁡ ( π 2 ⁢ r ⁢ ( T 2 - t ) ) ] 2 ] T 2 - r ≤ t ≤ T 2 . 1 2 ⁡ [ 1 - sin ⁡ ( π 2 ⁢ r ⁢ ( t - T 2 ) ) ] T 2 ≤ t ≤ T 2 + r . ⁢ ⁢ and ⁢ ⁢ φ j ⁡ ( t ) = 2 T ⁢ sin ⁡ ( π ⁡ ( k + 1 / 2 ) ⁢ ( t + T / 2 ) T ) .

The computations become increasingly complex as the parameter k increases. Accordingly, some embodiments provide for an “almost orthogonal” windowing systems using B-spline constructions. These B-spline constructions allow for a direct computation of the Fourier coefficients.

The analysis of the error generated by the projection method involves looking at the decay rates of the Fourier coefficients. Working with the standard basis, for ƒεC(

_(2Φ)), the modulus of continuity can be defined as:

${{\mu(\delta)} = {\sup\limits_{{{x - y}} \leq \delta}{{{f(x)} - {f(y)}}}}},$ and have that

${{\hat{f}\lbrack n\rbrack}} \leq {\frac{1}{2}{{\mu\left( {1/n} \right)}.}}$ We say that ƒ satisfies a Hölder condition with exponent α when there exists a constant K such that |ƒ(x+δ)−ƒ(x)|≦Kδ ^(α). When ƒ is k-times continuously differentiable and ƒ^(k) satisfies a Hölder condition with exponent α, then there exists a constant K such that

${{\hat{f}\lbrack n\rbrack}} \leq {K{\frac{1}{n^{k + \alpha}}.}}$

The sharp cut-offs χ_([kT,(k+1)T]) have a decay of only 1/ω in frequency. The orthonormal ON windowing systems can be designed so that the windows have decay 1/(ω)^(k+2) in frequency. Thus, this can make the error on each block summable.

Assuming

_(k) is C^(k), then

˜1/(ω^(k+2). The error ε_(kp) on a given block can further be analyzed. Let M=∥(ƒ·

_(k))∥L²(

). Then

ɛ kp = ⁢ sup ⁢  ( f ⁡ ( t ) · ) - [ ∑ n = - N N ⁢ 〈 f · k , Ψ n , k 〉 ⁢ Ψ n , k ⁡ ( t ) ]  = ⁢ sup ⁡ [ ∑  n  > N ⁢ 〈 f · k , Ψ n , k 〉 ⁢ Ψ n , k ⁡ ( t ) ] ≤ ⁢ [ ∑  n  > N ⁢ M n k + 2 ] .

The projection method according to at least some embodiments can be applied with binary signals. For example, the Walsh functions {Υ_(n)} form an orthonormal basis for L²[0, 1]. The basis functions have the range {1, −1}, with values determined by a dyadic decomposition of the interval. The Walsh functions are of modulus 1 everywhere. The functions are given by the rows of the unnormalized Hadamard matrices, which are generated recursively by

${H(2)} = \begin{bmatrix} 1 & 1 \\ 1 & {- 1} \end{bmatrix}$ ${H\left( 2^{({k + 1})} \right)} = {{{H(2)}{H\left( 2^{k} \right)}} = \begin{bmatrix} {H\left( 2^{k} \right)} & {H\left( 2^{k} \right)} \\ {H\left( 2^{k} \right)} & {- {H\left( 2^{k} \right)}} \end{bmatrix}}$

It is noted that although the rows of the Hadamard matrices give the Walsh functions, the elements have to be reordered into sequency order. The components are typically arranged in ascending order of zero crossings (see for example K. G. Beauchamp, Applications of Walsh and Related Functions, Academic Press, London, 1984). The Walsh functions can also be interpreted as the characters of the group G of sequences over

₂. i.e., G=(

₂

. The Walsh basis is a well-developed system for the study of a wide variety of signals, including binary. The projection method according to some present embodiments works with the Walsh system to create a wavelet-like system to do signal analysis.

First assume that the time domain is covered by a uniform block tiling χ_([kT,(k+1)T])(t). The function can be translated and/or scaled on this kth interval back to [0, 1] by a linear mapping. Denote the resultant mapping as ƒ_(k), which is an element of L²[0, 1]. Given that ƒε

_(Ω), there exists an N>0 (N=N(Ω)) such that

ƒ_(k), Υ_(n)

=0 for all n>N. The decomposition of ƒ_(k) into Walsh basis elements is

$\sum\limits_{u = 0}^{N}{\left\langle {f_{k},\Upsilon_{n}} \right\rangle{\Upsilon_{n}.}}$ Translating and summing up gives a projection representation ƒp:

$\begin{matrix} {{f_{??}(t)} = {\sum\limits_{k \in Z}^{\;}{\left\lbrack {\sum\limits_{n = 0}^{N}{\left\langle {f_{k},\Upsilon_{n}} \right\rangle\Upsilon_{n}}} \right\rbrack{{\chi_{\lbrack{{kT},{{({k + 1})}T}}\rbrack}}^{(t)}.}}}} & (31) \end{matrix}$

The windowing system results in limited or substantially no loss of signal data and orthogonality between signal blocks. Similarly, an orthonormal window system may be used with fixed T and/or adaptive τ window length. Again, the function ƒ·

_(k)(t) can be translated and/or scaled on this kth window back to [0, 1] by a linear mapping. The resultant mapping can be denoted as ƒ_(k) _(τ) . The resultant function is an element of L²[0, 1]. Given that ƒε

_(Ω), there exists an M>0 (M=M(Ω)) such that

ƒ_(k) _(τ) , Υ_(n)

=0 for all n>M. The decomposition of ƒ_(k) _(τ) into Walsh basis elements is

$\sum\limits_{n = 0}^{M}{\left\langle {f_{k},\Upsilon_{n}} \right\rangle{\Upsilon_{n}.}}$

Again, translating and summing up gives the projection representation ƒp_(τ)

$\begin{matrix} {{f_{{??}_{W}}(t)} = {\sum\limits_{k \in Z}^{\;}{\left\lbrack {\sum\limits_{n = 0}^{N}{\left\langle {f_{k},\Upsilon_{n}} \right\rangle\Upsilon_{n}}} \right\rbrack{{{??}_{k}(t)}.}}}} & (32) \end{matrix}$

Almost Orthogonal Systems

Some embodiments simply provide processing by almost maintaining the orthogonality between windows. The partition of unity systems do not preserve orthogonality between blocks when implementing the almost orthogonality. However, they are typically easier to compute and typically easier to build in circuitry and/or ASICs. Therefore, these systems can be used to approximate the Cap system with B-splines. Using these approximations, windowing systems can be provided that nearly preserve orthogonality. In many instances, each added degree of smoothness in time can add to the degree of decay in frequency.

The concept of almost maintaining orthogonality allows some embodiments to create windowing systems that are more computable, and in some instance can be more easily constructed or implemented (e.g., through circuitry, hardware and/or software), such as the Bounded Adaptive Partition of Unity systems {

_(k)(t)} with the orthogonality preservation of the ON Window System {

_(k)(t)}. For example, {

_(k)(t)}=

Cap_([(k)T−r,(k+1)T+r])(t) was considered, where

${{Cap}_{I}(t)} = \left\{ \begin{matrix} 0 & {{t} \geq {{T/2} + {r.}}} \\ 1 & {{t} \leq {{T/2} - {r.}}} \\ {\sin\left( {{\pi/\left( {4r} \right)}\left( {t + \left( {{T/2} + r} \right)} \right)} \right)} & {{{{- T}/2} - r} < t < {{{- T}/2} + {r.}}} \\ {\cos\left( {{\pi/\left( {4r} \right)}\left( {t - \left( {{T/2} - r} \right)} \right)} \right)} & {{{T/2} - r} < t < {{T/2} + {r.}}} \end{matrix} \right.$

Let 0<r<<T, an almost orthonormal (ON) System for adaptive and ultra-wide band sampling in accordance with some embodiments provides a set of functions {

_(k)(t)} for which there exists δ, 0≦δ≦½, such that

-   -   (i.) supp(         _(k)(t))         [kT−r, (k+1)T+r] for all k.     -   (ii.)         _(k)(t))≡1 for tε[kT+r, (k+1)T−r] for all k.     -   (iii.)         _(k)((kT+T/2)−t)=         _(k)(t−(kT+T/2)), tε[0, T/2+r].     -   (iv.) 1−δ≦[         _(k)(t))]²+[         _(k+1)(t))]²≦1+δ.     -   (v.){         [n]}εl¹.         Accordingly, some embodiments start with         Cap_([(k)T−r,(k+1)T+r])(t). These embodiments can place         equidistant knot points −T/2−r<t<−T/2+r and T/2−r<t<T/2+r, and         approximate sin, cos in those intervals with C^(k) B-splines.         For these systems, δ→0 as k increases. The partition of unity         systems typically do not preserve orthogonality between blocks         relative to the almost orthogonality embodiments. However, they         are typically easier to compute and they can be easier to build         in circuitry. Therefore, these systems can be used to         approximate the Cap system with B-splines. These embodiments can         provide windowing systems that nearly preserve orthogonality.         Each added degree of smoothness in time adds to the degree of         decay in frequency.

As such, the present embodiments provide windowing systems for time-frequency analysis that can have variable partitioning length, variable roll-off and/or variable smoothness. This variability is distinct from other standard sampling techniques, such as the standard Shannon (W-K-S) sampling that effectively provides a signal stationary point-of-view. FIG. 5 shows an example sampling technique in accordance with a standard Shannon (W-K-S) sampling. This sampling represents a signal stationary point-of-view sampling that is limited to a fixed sampling rate with rigid boundaries.

Referring back to FIG. 2, some embodiments are configured to provide for a projection method of processing a signal. A signal is initially windowed in step 212. Again, the windowing can be provided through an adaptive windowing.

FIGS. 6A-6B show simplified graphical representations of a method of projection sampling in accordance with some embodiments. Referring to FIG. 6A, a signal s(t) 610 is received, which can have variable bandwidth over the duration of the signal. For example, the signal s(t) 610 can be similar to the signal 310 of FIG. 3A, and can include a high frequency burst 612. As described above, the projection sampling includes the partitioning of the signal into a plurality of windows (s(t). ′

_(k)(t)), such as ′

₁, ′

₂, ′

₃ . . . ′

_(k). In some embodiments, the partitioning can provide for adaptive windows. where the windows can be adaptive based on N=[T·Ω], which can in at least some instances accommodate the variations in the signal bandwidth.

The windows are processed to perform a transform series expansions, for example, through Fourier series (^s) 616 providing transform coefficients 618 (s·W_(k)

Ψ_(n,k)) in the frequency domain relative to the respective windows and in accordance with the number of basis elements (N) corresponding to the respective window (k). As described above, in some implementations the number of basis elements N is defined according to a ceiling based on T·Ω (i.e., N=┌T·Ω┐). The windows can then be adaptive, for example, based on bandwidth Ω. As further described above, however, any one of the variables (N, T, Ω) may be varied in adapting the windows. To simplify implementation, for example through a system and/or circuitry, some embodiments may fix N.

It is noted that the processing to provide the expansion may be performed in parallel. In some embodiments, as described above, the transform coefficients (e.g., the Fourier coefficients) for a window ′

_(k) can be generated in parallel. Further, the expansion can maintain orthogonality of adjacent windows, including the orthogonality for overlapping regions of adjacent windows at least in part through the product of the windowed signal s·′

_(k) with Ψ_(n,k).

Referring to FIG. 6B, a projection of the coefficients 630 is shown relative to each window. An analysis is performed, in part, through a summation

$\left( {\sum\limits_{n = 1}^{N}{C_{({n,k})}\Psi_{n,k}}} \right)$ of the individual Fourier series 622 in accordance with

${{s(t)} \approx {\sum\limits_{k}^{\;}\left\lbrack {\sum\limits_{n = 1}^{N}{\left\langle {{s \cdot W_{k}},\Psi_{n,k}} \right\rangle\Psi_{n,k}}} \right\rbrack}},$ (see equations 26 and 27 above). In some embodiments, this can provide an recreation of a close approximation of the original signal.

Referring back to FIG. 2, again some embodiments provide the projected sampling based on the adaptive signal windowing 212, a transmission or analysis 214 of the signal and a reconstruction or synthesis of the signal 216. FIG. 7 shows a simplified graphical representation of at least portions of a series of windows 612-614 (′

_(k), ′

_(k+1), ′

_(k+2), etc.), in accordance with some embodiments, provided in response to the windowing in step 212. Some embodiments implement a number of separate processings to perform the windowing. Further, in some instances, the separate processing can be performed by separate circuitry and/or chips. In the example in FIG. 7, there are three separate processings, where in some embodiments the processing can be performed by three separate processes and/or separate circuitry or chips. In this example, processing is being performed for the first window ′

_(k) 612, while preparing to initiate processing for the second window ′

_(k+1) 613, and while processing for the third window ′

_(k+2) is idle or in a rest state. This rest state can be advantageous in some implementations as it can allow circuitry to cool down to limit or avoid overheating of the circuitry, which can cause non-linear operation of the circuitry.

As window 1 begins to ramp down, the processing relative to the signal corresponding to window 2 begins ramping up, while processing corresponding to window 3 can be idle. Similarly, as window 2 begins ramping down, the processing of the signal corresponding to window 3 ramps up, while processing corresponding to window 1 (i.e., a subsequent window following window 3 in time) is idle. This provides a cycling of processing, and in this example, provides a three phase cycling (modulo 3). Other cycling can be provided, such as a five phase cycle when it would be beneficial, such as providing greater idle or cool down time.

The multiple modulo implementation can further be advantageous, for example, in that when ′

_(k) is ramping down, and ′

_(k+1) is ramping up; processing would have to effectively wrap ′

_(k+1) to simultaneously provide processing for ′

_(k+2). Alternatively, with the plurality of processing phases, while ′

_(k+1) is in its flat portion ′

_(k) can be off, and ′

_(k+2) is getting ready to activate. Then processing can subsequently reconnect with ′

_(k) while ′

_(k+2) is in its flat spot, hence the modulo 3 and the three base windows.

FIG. 8 shows a simplified flow diagram of a process 810 of providing the transmission and/or analysis of the windowed signal (s(t)·′

_(k)(t)), in accordance with some embodiments, and in some instances can be used to implement step 214 of the process 210 of FIG. 2, and in some embodiments, corresponds to the processing of a windowed signal represented in FIGS. 6A-6B. In step 812, the windowed signal is received and read in. In step 814, respective periodic series expansions are performed on the window (k). This can provide a computable, atomic time-frequency decomposition of the signal, which can be sensitive to both position in time and frequency simultaneously. For example, a generalized Fourier series expansion can be applied in obtaining the coefficients.

It is noted that in some embodiments, some or all of the expansion (and/or sampling, e.g., analog-to-digital sampling) can be performed in parallel, where multiple coefficients of a window, and typically all of the coefficients of a window can be processed in parallel. As described above, the parallel processing can be advantageous with ultra-wide band (UWB) signals to perform the expansion by constructed in parallel. In some instances, the parallel processing may be achieved, for example, by fixing N across multiple windows over the signal, which can fix the number of base elements (and “Fourier coefficients”) that are computed. For example, an UWB signal can be mapped quickly using a fixed window size, where with each window the processing does not have to serially wait for samples. Instead, the sampling coefficients (e.g., coefficients 618 of FIG. 6A) for an entire window of the signal can be constructed simultaneously in parallel in the frequency space. The parallel processing is typically quicker. Adaptive windowing can still be preformed while utilizing parallel processing, but typically at the expense of increased processing and/or processing time.

Still referring to FIG. 8, in step 816 the series coefficients (e.g., Fourier coefficients) can be transmitted, stored and/or analyzed. For example, the sampling and the Fourier coefficients can be utilized as a first part of a spectrum analyzer, where spectral analysis can be performed on the Fourier coefficients. Further, in at least some embodiments the transmit, store and/or analysis of step 816 can be at least partially implemented consistent with FIG. 6B based in the projection of the coefficients 630 (C_((1,k)), C_((2,k)), . . . , C_((N,k))).

FIG. 9 depicts a simplified flow diagram of a process 910 of providing a reconstruction and/or synthesis of the coefficients in accordance with some embodiments. In some embodiments, the process 910 can implement some or all of step 216 of FIG. 2. In step 912, coefficients for at least a pair of adjacent windows are received. In step 914, the synthesis of overlapping windows is performed such that

${\sum\limits_{n = 1}^{N}{C_{({n,k})}{\Psi_{n,k}(t)}}} + {\sum\limits_{n = 1}^{N}{C_{({n,{k + 1}})}{{\Psi_{n,{k + 1}}(t)}.}}}$

Because of the previously performed analysis in the frequency domain the errors on each window are summable, and the reconstruction through the summation during the synthesis provides substantially a perfect reconstruction in the time domain. Accordingly, in some embodiments, the coefficients are considered in pairs of adjacent windows, for example: {C_((1,k)), C_((2,k)), . . . , C_((N,k))}, and {C_(1,k+1)), C_((2,k+1)), . . . , C_((N,k+1))}.

This summation is not limited to just k and k+1, but is applicable to any k (arbitrary index k). Again, the use of the pair of coefficients is based on the overlap between windows. The Ψ and C_(k) have built into them the overlap, and the coefficients of adjacent windows C_(n,k) and the C_(n,k+1) cooperate with each other perfectly (e.g., sine and cosine, or substantially any orthonormal basis), consistent with the folding technique. Accordingly, from a summation point of view, the ramps of the windows are effectively eliminated. Further, in some implementations, the summation can split coefficients relative to overlapping windows, while still summing in at least pairs of windows.

Still referring to FIG. 9, in step 916 a reindexing is performed (e.g., k goes to k+1 and k+1 goes to k, in the formula, relative to a subsequent window to continue the window pairing. The process 910 can then return to step 912 to continue the reconstruction and/or synthesis of the signal in the time domain over the remainder of the signal (or until the process is otherwise terminated).

In some implementations, the transform and computation of the coefficients can be considered as analysis under step 214 of FIG. 2, while the synthesis in step 216 of FIG. 2 can comprise the re-building of the signal in the time domain. It is noted that at least a portion of the reconstruction and/or synthesis of step 216 and the process 910 occurs in the time domain. Accordingly, the reconstruction and/or synthesis can introduce truncation error. The amount of truncation error, however, can be at least partially controlled and/or reduced by providing smooth ramping windows, where the smoother the windows the smaller the truncation error that occurs. It is further noted, however, the there is no jitter error at least in part due to the windowing and/or parallel processing. Similarly, there is typically no aliasing error as a result of the above described processes because there typically is no aliasing implemented.

In traditional analog-to-digital (A/D) and/or digital-to-analog (D/A) sampling there are four main types of errors: truncation error that typically cut off samples in time, aliasing error where sample typically cannot be performed quickly enough, jitter error in which incorrect placement of the sample occurs, and computational error that is generally inherent error resulting from the systems implementing the sampling. Again, as described above, many if not all of the embodiments can substantially eliminate two of the main errors. Generally, there is no aliasing performed and as such there is no aliasing error. Further, the windowing provided in the present embodiments, parallel processing and/or the pairing of adjacent windows can eliminate or substantially reduce jitter error. Accordingly, the errors result from truncation errors and computation errors. The truncation errors can occur on each window. These truncation errors, however, can be reduced through control of the smoothness of the window partitions or boundaries, where the smoother the window the less truncation error that occurs. Again, computational error is inherent in the system and can be reduced through precision design, manufacturing, implementation and/or assembly of the systems, code and/or software used in implementing the present embodiments

The present embodiments provide windowing methods and systems for time-frequency analysis. At least some of these embodiments provide for windowing with variable partitioning length, variable roll-off and variable smoothness. Further, in some instances, the adaptive windows can be constructed with smooth bounded adaptive partitions (which may be of unity) using B-splines. These methods and systems are useful whenever a partition of unity is used, such as in compressed sensing.

Some embodiments further preserve orthogonality of orthonormal systems between adjacent windows. These are used to develop windowing systems for time-frequency analysis, and can provide a “projection method” for time-frequency analysis of a signal. Still further, some embodiments simplify and/or reduce processing through a concept of almost orthogonality and the B-spline techniques to create almost orthogonal windowing systems that can often be more readily computable and/or constructible through circuits and/or chips than the orthogonality preserving systems, which can result in lower costs and/or faster processing while still providing results that satisfy desired threshold accuracy.

The projection method can comprise a method for analog-to-digital encoding that can be implemented similar to or as an alternative to Shannon Sampling. Further, some embodiments of the projection method can provide accurate processing of adaptive frequency band (AFB) and/or ultra-wide band (UWB) signals that typically cannot accurately be processed with traditional W-K-S Sampling. The present embodiments provide quick and accurate computations of Fourier coefficients, which in some implementations can be computed in hardware, where at least some embodiments can be configured to implement the effective adaptive windowing systems. For example, the computation of the coefficients allow for very short (e.g., for UWB) and/or variable (e.g., for AFB) windows, and the design of the orthonormal (ON) windowing systems preserve orthogonality between blocks and provide decay for the modulation of the signals caused by truncation in time. Given an ON window system {

_(k)(t)} and {Ψ_(k,j)}, an orthonormal basis that preserves orthogonality between adjacent windows, for ƒε

_(Ω), letting N=N(T, Ω) such that

ƒ·

_(k), Ψ_(n)

=0 for n>N; then, ƒ(t)≈ƒp(t), where

${f_{??}(t)} = {\sum\limits_{k \in Z}^{\;}{\left\lbrack {\sum\limits_{n = {- N}}^{N}{\left\langle {{f \cdot {??}_{k}},\Psi_{n}} \right\rangle{\Psi_{n}(t)}}} \right\rbrack.}}$

Further, with the flexibility of the windowing systems, an adaptive projection system for ON windowing can be achieved. Given ƒ, {circumflex over (ƒ)}εL²(

) and ƒ having a variable but bounded band-limit Ω(t), with τ(t) being an adaptive block of time, letting {

_(k)(t)} be a ON window system with window size τ(t)+2r on the kth block and {Ψ_(k,j)} be an orthonormal basis that preserves orthogonality between adjacent windows; given τ(t), with Ω(t)=max {Ω(t): tετ(t)}, and letting N(t)=N(τ(t), Ω(t)) be such that

ƒ·

_(k), Ψ_(n)

=0; then, ƒ(t)≈ƒp(t), where

${f_{??}(t)} = {\sum\limits_{k \in Z}^{\;}{\left\lbrack {\sum\limits_{n = {- {N{(t)}}}}^{N{(t)}}{\left\langle {{f \cdot {??}_{k}},\Psi_{n}} \right\rangle{\Psi_{n}(t)}}} \right\rbrack.}}$

It is noted that this adaptable time segmentation may, in some instances, make the analysis more complicated, but demonstrates at least some of the benefits the present embodiments provide over conventional means. Further, at least some aspects of the projection methods can be considered, in some instances, as an “adaptive Gabor-type” system for analysis in time-frequency. These methods and/or systems can be configured to provide either very short and/or variable windowing, with windows created using the theory of splines. The corresponding modulation terms are from an ON basis which preserves orthogonality between adjacent blocks and can be tailored to the class of input signals analyzed. It was considered that if one looks at the construct for binary signals using Walsh functions, one is reminded of Haar wavelets. Some embodiments provide what can be considered Walsh projection systems. These systems can be configured as an “adaptive wavelet” system with substantially no fixed underlying window size. A potential drawback or price paid for achieving this adaptability can be the giving up of the structure of the Gabor or wavelet systems.

In some instances, the above described theory of windows, defined according to mathematical structures, in which to express sampling via the projection method. Many non-uniform sampling schemes could be expressed in terms of this language of frames. Accordingly, some embodiments provide a computable atomic decomposition of time-frequency space. These embodiments can be configured to provide a way of non-uniformly windowing or tiling time and frequency so that when a the signal has, for example, a burst of high-frequency information, the methods and/or systems can window quickly and efficiently in time and broadly in frequency, whereas when the signal has a relatively low-frequency segment, windowing can be defined broadly in time and efficiently in frequency.

The present methods and systems can address efficiency and cost issues of broadband wireless and wire line transmission and reception. The need to transmit a much larger volume of information at lesser costs is imperative in the ever-expanding communications industry. These methods and systems can allow signals to be processed through various communications devices significantly times faster than existing systems. Further, the present embodiments provide a significant change of view in signal processing, which movies the process from one of a stationary viewpoint to a short-term or adaptive windowed stationarity. There are numerous applications for the present embodiments that can:

-   -   result in the development of low-cost transceivers;     -   allow for more throughput or better communication quality in         existing communication links;     -   contribute to the growing demand for ultra-sensitive electronic         equipment (e.g., warfare equipment in the defense arena);     -   allow for more communications of all types from all sources         processed per energy spent on communication; and     -   numerous other advantageous results.

Techniques for windowing are useful in developing the time-frequency analysis of functions. Some embodiments provide windowing systems that have variable partitioning length, variable roll-off and variable smoothness. For example, some embodiments can be configured to construct smooth bounded adaptive partitions, which in some instances can be of unity, using B-splines. These systems give a flexible adaptive partition of unity of variable smoothness. Further, some embodiments can be configured to preserve orthogonality of orthonormal systems between adjacent windows. For example, these embodiments may be used to provide tiling systems for time-frequency analysis, and give a “projection method” for time-frequency analysis of a signal. Still further, some embodiments implement a method of almost orthogonality and the B-spline techniques to create almost orthogonal windowing methods and systems that can be more computable and/or constructible in some instances than some of the orthogonality preserving methods and/or systems.

Again, the present embodiments provide a computable atomic decomposition of time-frequency space. Some embodiments provide efficient methods to analyze signals allowing for changing and/or ultra-wide frequency bands. Further, some embodiments provide non-uniform windowing time and frequency so that when a signal has a variation in bandwidth the windowing can be altered, such as when a signal has a burst of high-frequency information the method and/or system can window quickly and efficiently in time and broadly in frequency, whereas when the signal has a relatively low frequency segment the method and/or system can window broadly in time and efficiently in frequency. Still further, the systems are readily implemented in circuitry.

FIG. 10, there is illustrated a system 1000 that may be used in processing signals in accordance with at least some embodiments. The system 1000 can include a received and/or transceiver 1002, one or more communication links, paths, buses or the like 1004, and one or more processing systems, chips or units 1006. The transceiver 1002 can be configured to receive the signal to be processed. The processing systems 1006 can be substantially any circuitry, circuits, chips, ASICs and/or combinations thereof that can implement the processing, which can include but is not limited to one or more of perform the windowing, the transform series expansion, the calculations, summations, sampling, transmitting, storing, analyzing, reconstructing, synthesizing, transmitting and the like. Similarly, the processing system 1006 may include one or more processors, microprocessors, central processing units, logic, local digital storage, firmware and/or other control hardware and/or software. As described above, in some instances, multiple phase cycling (e.g., three phase cycling, five phase cycling, etc.) may be implemented. As such, the system may include multiple processing systems 1006 to implement the multiple cycles.

The methods, techniques, systems, devices, services, and the like described herein may be utilized, implemented and/or run on many different types of devices and/or systems. Referring to FIG. 11, there is illustrated a system 1100 that may be used for any such implementations, in accordance with some embodiments. One or more components of the system 1100 may be used for implementing any system, apparatus, module, unit or device mentioned above or below, or parts of such systems, apparatuses, modules, unit or devices, such as for example any of the above or below mentioned circuitry, chips, ASICs, systems, processing systems 1006, processors, and the like. However, the use of the system 1100 or any portion thereof is certainly not required.

By way of example, the system 1100 may comprise a controller or processor module 1112, memory 1114, one or more communication links, paths, buses or the like 1120, and in some instances a user interface 1116. A power source or supply (not shown) is included or coupled with the system 1100. The controller 1112 can be implemented through one or more processors, microprocessors, central processing unit, logic, local digital storage, firmware and/or other control hardware and/or software, and may be used to execute or assist in executing the steps of the methods and techniques described herein, and control various transforms, analysis, transmissions, storage, reconstruction, synthesis, windowing, measuring, communications, programs, interfaces, etc. The user interface 1116, when present, can allow a user to interact with the system 1100 and receive information through the system. In some instances, the user interface 1116 may includes a display 1122, LEDs, audio output, and/or one or more user inputs 1124, such as keyboard, mouse, track ball, touch pad, touch screen, buttons, track ball, etc., which can be part of or wired or wirelessly coupled with the system 1100.

Typically, the system 1100 further includes one or more communication interfaces, ports, transceivers 1118 and the like allowing the system 1100 to at least receive signals, which can be communicated wired or wirelessly over substantially any communication medium (e.g., over a distributed network, a local network, the Internet, communication link 1120, other networks or communication channels with other devices and/or other such communications). Further the transceiver 1118 can be configured for wired, wireless, optical, fiber optical cable or other such communication configurations or combinations of such communications.

The system 1100 comprises an example of a control and/or processor-based system with the controller 1112. Again, the controller 1112 can be implemented through one or more processors, controllers, central processing units, logic, software and the like. Further, in some implementations the controller 1112 may provide multiprocessor functionality.

The memory 1114, which can be accessed by the controller 1112, typically includes one or more processor readable and/or computer readable media accessed by at least the controller 1112, and can include volatile and/or nonvolatile media, such as RAM, ROM, EEPROM, flash memory and/or other memory technology. Further, the memory 1114 is shown as internal to the system 1110; however, the memory 1114 can be internal, external or a combination of internal and external memory. The external memory can be substantially any relevant memory such as, but not limited to, one or more of flash memory secure digital (SD) card, universal serial bus (USB) stick or drive, other memory cards, hard drive and other such memory or combinations of such memory. The memory 1114 can store code, software, executables, scripts, data, signals, samples, coefficients, programming, programs, media stream, media files, identifiers, log or history data, user information and the like.

One or more of the embodiments, methods, processes, approaches, and/or techniques described above or below may be implemented in one or more processor and/or computer programs executable by a processor-based system. By way of example, such a processor based system may comprise the processor based system 1100, a computer, an encoder, an analog-to-digital converter, a player device, etc. Such a computer program may be used for executing various steps and/or features of the above or below described methods, processes and/or techniques. That is, the computer program may be adapted to cause or configure a processor-based system to execute and achieve the functions described above or below. For example, such computer programs may be used for implementing any embodiment of the above or below described steps, processes or techniques. As another example, such computer programs may be used for implementing any type of tool or similar utility that uses any one or more of the above or below described embodiments, methods, processes, approaches, and/or techniques. In some embodiments, program code modules, loops, subroutines, etc., within the computer program may be used for executing various steps and/or features of the above or below described methods, processes and/or techniques. In some embodiments, the computer program may be stored or embodied on a computer readable storage or recording medium or media, such as any of the computer readable storage or recording medium or media described herein.

Accordingly, some embodiments provide a processor or computer program product comprising a medium configured to embody a computer program for input to a processor or computer and a computer program embodied in the medium configured to cause the processor or computer to perform or execute steps comprising any one or more of the steps involved in any one or more of the embodiments, methods, processes, approaches, and/or techniques described herein. For example, some embodiments provide one or more computer-readable storage mediums storing one or more computer programs for use with a computer simulation, the one or more computer programs configured to cause a computer and/or processor based system to execute steps comprising: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal; transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of signal in the frequency domain; and mapping the samples in the frequency domain back into the time domain.

The present embodiments provide methods and systems configured to provide time-frequency analysis, including windowing systems providing signal time-frequency analysis. For example, some embodiments provide methods of processing signals. These methods can comprise: receiving a signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal; and transforming each portion of the signal of each windows producing respective expansions in a frequency domain and analyzing and/or obtaining respective samples of the respective expansions in the frequency domain. Some embodiments further map the samples in the frequency domain back into the time domain.

Many of the functional units described in this specification have been labeled as systems, modules, units, etc., in order to more particularly emphasize their implementation independence. For example, a system or module may be implemented as a hardware circuit comprising custom VLSI circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A system and/or module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.

Some or all of the systems and/or modules may also be implemented in software for execution by various types of processors. An identified system and/or module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module.

Indeed, a system or module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within systems or modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.

While the invention herein disclosed has been described by means of specific embodiments, examples and applications thereof, numerous modifications and variations could be made thereto by those skilled in the art without departing from the scope of the invention set forth in the claims. 

What is claimed is:
 1. A method of processing a signal, comprising: using one or more processors configured to perform the steps of: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal; transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of the signal in the frequency domain while preserving orthogonality of basis elements in the windows, including regions of overlap; and mapping the samples in the frequency domain back into the time domain.
 2. The method of claim 1, wherein the transforming the windows of the signal comprises individually applying Fourier series to each of the windows of the signal.
 3. The method of claim 1, wherein the adaptively partitioning the signal in the time domain into the plurality of windows comprises applying B-splines in constructing the windows of the signal.
 4. The method of claim 1, wherein the adaptively partitioning the signal in the time domain into the plurality of windows comprises controlling a smoothness in time and corresponding decay in frequency of each window of the signal.
 5. The method of claim 1, wherein the adaptively partitioning the signal in the time domain into the plurality of windows comprises partitioning the signal in the time domain into the plurality of windows such that a plurality of the windows that are adjacent have overlapping segment boundaries.
 6. The method of claim 1, wherein the adaptively partitioning the signal in the time domain into the plurality of windows comprises defining the partitions such that orthogonality is substantially preserved for orthonormal (ON) system between adjacent windows.
 7. The method of claim 1, further comprising: encoding the signal through an encoder, comprising performing: the receiving the communication signal; the adaptively partitioning the signal in the time domain into the plurality of windows of the signal; the transforming each of the windows of the signal producing respective expansions in the frequency domain and obtaining respective samples of the windows of the signal in the frequency domain while preserving orthogonality of basis elements in the windows, including regions of overlap; and the mapping the samples in the frequency domain back into the time domain.
 8. A method of processing a signal, comprising: using one or more processors configured to perform the steps of: receiving a signal; partitioning the signal in a time domain into a plurality of windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain while preserving orthogonality between at least two of the plurality of windows, where for each window of the signal of the respective expansions are obtained through parallel processing obtaining in parallel respective samples of the windows of signal in the frequency domain.
 9. The method of claim 8, wherein the transforming each of the windows comprises transforming each of the windows such that sampling coefficients for an entire window is constructed simultaneously in parallel in the frequency domain.
 10. The method of claim 8, further comprising: mapping the samples in the frequency domain back into the time domain.
 11. The method of claim 10, wherein the partitioning the signal comprises adaptively partitioning the signal such that each of the plurality of windows are partitioned as a function of bandwidth of the window.
 12. The method of claim 10, wherein the partitioning the signal comprises partitioning the signal according to a fixed window size of each of the plurality of windows.
 13. A method of processing a signal, comprising: using one or more processors configured to perform the steps of: processing a signal; partitioning the signal in a time domain into a plurality of windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain and obtaining respective samples of the windows of signal in the frequency domain while preserving orthogonality between at least two of the plurality of windows.
 14. The method of claim 13, wherein the partitioning the signal comprises partitioning the signal such that the at least two of the plurality of windows have overlapping regions; and wherein the transforming each of the windows of the signal comprises transforming each of the windows of the signal while preserving the orthogonality between the at least two of the plurality of windows including preserving the orthogonality in the overlapping regions.
 15. The method of claim 14, wherein the partitioning the signal in the time domain into the plurality of windows comprises applying B-splines in constructing the windows of the signal.
 16. The method of claim 14, wherein the partitioning the signal in the time domain into the plurality of windows of the signal comprises adaptively partitioning the signal in the time domain into the plurality of windows of the signal such that the windows vary as a function of bandwidth.
 17. A method of processing a signal, comprising: using one or more processors configured to perform the steps of: receiving a communication signal; adaptively partitioning the signal in a time domain into a plurality of windows of the signal, wherein the adaptively partitioning comprises applying B-splines in constructing the windows of the signal; and transforming each of the windows of the signal producing respective expansions in a frequency domain while preserving orthogonality between at least two of the plurality of windows and analyzing the transformed windows of the signal in the frequency domain.
 18. The method of claim 17, wherein the partitioning the signal comprises partitioning the signal such that the at least two of the plurality of windows have overlapping regions; and wherein the transforming each of the windows of the signal comprises transforming each of the windows of the signal while preserving the orthogonality between the at least two of the plurality of windows including preserving the orthogonality in the overlapping regions. 